Letter Graphs and Geometric Grid Classes of Permutations

We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, the world of permutation patterns. Both these notions capture important properties their respective classes objects. prove that are equivalent in sense class is geometrically griddable if only corresponding inversion graphs has bounded lettericity.